The Inverse of a Matrix

Tags: #◇CSMATH2 #◇Linear Algebra #◇Computational Mathematics #◇Matrices #◇Matrix Operations #◇Inverse Matrix #◇Computer Science #◇Vector Spaces #◇Linear Transformations

---

◇Overview

The inverse of a square matrix $A$ is the matrix $A^{-1}$ such that:

◇Key Concepts

Existence and Uniqueness Properties of Matrix Inverses Example Methods for Computing the Inverse Example

◇Details / Theory

The inverse of a square matrix $A$ is the matrix $A^{-1}$ such that:
$A \cdot A^{-1} = A^{-1} \cdot A = I$
where $I$ is the identity matrix of the same size as $A$.
(Handout 3, Pages 8-10) Existence and Uniqueness:
A matrix is invertible (or nonsingular) if and only if any of the following equivalent conditions hold:

1. $\det(A) \neq 0$

2. $\text{rank}(A) = n$ (where $A$ is an $n \times n$ matrix)

3. The rows of $A$ form a linearly independent set

4. The columns of $A$ form a linearly independent set

5. The homogeneous system $AX = 0$ has only the trivial solution

6. The linear transformation $T(X) = AX$ is one-to-one (injective) and onto (surjective)

7. $A$ is row equivalent to the identity matrix $I$

8. $A$ can be expressed as a product of elementary matrices
   If the inverse exists, it is unique.
   PN: This collection of equivalent conditions is often called the "Invertible Matrix Theorem" and is one of the most important results in linear algebra. Properties of Matrix Inverses:

9. $(A^{-1})^{-1} = A$

10. $(cA)^{-1} = \frac{1}{c}A^{-1}$ for any nonzero scalar $c$

11. $(AB)^{-1} = B^{-1}A^{-1}$ (Note the order reversal)

12. $(A^T)^{-1} = (A^{-1})^T$

13. $\det(A^{-1}) = \frac{1}{\det(A)}$

14. If $A$ is invertible, then $A^k$ is invertible for any integer $k$, and $(A^k)^{-1} = (A^{-1})^k$

15. If $A$ is invertible and $A$ is similar to $B$ (i.e., $B = P^{-1}AP$ for some invertible $P$), then $B$ is also invertible
    Example:
    If $A = \begin{bmatrix} 1 & 2 \\ 3 & 4 \end{bmatrix}$, then $A^{-1} = \begin{bmatrix} -2 & 1 \\ 1.5 & -0.5 \end{bmatrix}$
    Verification: $A \cdot A^{-1} = \begin{bmatrix} 1 & 2 \\ 3 & 4 \end{bmatrix} \begin{bmatrix} -2 & 1 \\ 1.5 & -0.5 \end{bmatrix} = \begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix}$ Methods for Computing the Inverse:

16. Gauss-Jordan Elimination Method:
    Form the augmented matrix $[A|I]$
    Apply row operations to transform it to $[I|B]$
    The matrix $B$ is the inverse of $A$
    Example:
    Start with $\begin{bmatrix} 1 & 2 & | & 1 & 0 \\ 3 & 4 & | & 0 & 1 \end{bmatrix}$
    After row operations: $\begin{bmatrix} 1 & 0 & | & -2 & 1 \\ 0 & 1 & | & 1.5 & -0.5 \end{bmatrix}$
    Therefore, $A^{-1} = \begin{bmatrix} -2 & 1 \\ 1.5 & -0.5 \end{bmatrix}$

17. Adjoint Method:
    Calculate the determinant: $\det(A)$
    Find the cofactor matrix $C = [C_{ij}]$ where $C_{ij} = (-1)^{i+j} \times \det(M_{ij})$
    and $M_{ij}$ is the minor obtained by deleting the $i$-th row and $j$-th column of $A$
    Compute the adjoint: $\text{adj}(A) = C^T$
    The inverse is given by: $A^{-1} = \frac{1}{\det(A)} \cdot \text{adj}(A)$
    Example for a $2 \times 2$ matrix:
    If $A = \begin{bmatrix} a & b \\ c & d \end{bmatrix}$, then $A^{-1} = \frac{1}{ad-bc} \begin{bmatrix} d & -b \\ -c & a \end{bmatrix}$

18. Blockwise Inversion (for partitioned matrices):
    If $A = \begin{bmatrix} P & Q \\ R & S \end{bmatrix}$ where $P$ and the Schur complement $S - RP^{-1}Q$ are invertible, then:

    $A^{-1} = \begin{bmatrix} P^{-1} + P^{-1}Q(S-RP^{-1}Q)^{-1}RP^{-1} & -P^{-1}Q(S-RP^{-1}Q)^{-1} \\ -(S-RP^{-1}Q)^{-1}RP^{-1} & (S-RP^{-1}Q)^{-1} \end{bmatrix}$
    (Handout 4, Pages 12-15) Special Cases:

19. Diagonal Matrix: If $D = \text{diag}(d_1, d_2, \ldots, d_n)$ with all $d_i \neq 0$, then $D^{-1} = \text{diag}(1/d_1, 1/d_2, \ldots, 1/d_n)$

20. Triangular Matrix: If $T$ is an invertible triangular matrix, its inverse is also triangular of the same type

21. Orthogonal Matrix: If $Q$ is orthogonal (i.e., $Q^TQ = I$), then $Q^{-1} = Q^T$

22. Idempotent Matrix: If $A^2 = A \neq 0$, then $A$ is not invertible

23. Nilpotent Matrix: If $A^k = 0$ for some positive integer $k$, then $A$ is not invertible
    PN: While direct computation of the inverse is theoretically important, in practice, for solving linear systems, decomposition methods like LU or QR are often more efficient and numerically stable than explicitly computing $A^{-1}$.

◇Common Pitfalls

Not checking if the matrix is invertible before attempting to find the inverse ($\det(A) \neq 0$). Forgetting that $(AB)^{-1} = B^{-1}A^{-1}$ — the order reverses. Non-square matrices do not have a two-sided inverse.

◇Summary

TL;DR — A square matrix $A$ is invertible iff $\det(A) \neq 0$. Compute via Gauss-Jordan ($[A|I] \to [I|A^{-1}]$) or, for $2 \times 2$, the adjugate formula. Product inverses reverse order.

◇Links

Related: Source / Reference:

◇References & Navigation

• Previous Topic: ◇Zero Matrix
• Next Topic: ◇Determinants
• Related Notes: ◇Matrices Detailed